III-Non-Distributive Blameworthiness

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Comparing Distributive and Non - Distributive Conflict Transitions

(Preliminary draft; references incomplete. Feedback welcome to [email protected] and [email protected], but please do not circulate.)

متن کامل

Non-matchable distributive lattices

Based on an acyclic orientation of the Z-transformation graph, a finite distributive lattice (FDL for short)M(G) is established on the set of all 1-factors of a plane (weakly) elementary bipartite graph G. For an FDL L, if there exists a plane bipartite graph G such that L is isomorphic to M(G), then L is called a matchable FDL. A natural question arises: Is every FDL a matchable FDL? In this p...

متن کامل

On the Distributive and Non-Distributive Interpretation in Japanese

Through an analysis of two different types of floating numeral quantifier (FNQ) constructions in Japanese, the present paper investigates the distributive and non-distributive interpretation in Japanese. Discussion of the interpretative issues related to ambiguity and intonation has indicated that FNQs are potentially ambiguous, offering both distributive and non-distributive readings.

متن کامل

Incremental Maintenance for Non-Distributive Aggregate Functions

Incremental view maintenance is a well-known topic that has been addressed in the literature as well as implemented in database products. Yet, incremental refresh has been studied in depth only for a subset of the aggregate functions. In this paper we propose a general in-cremental maintenance mechanism that applies to all aggregate functions, including those that are not distributive over all ...

متن کامل

Definability in substructure orderings, III: finite distributive lattices

Let D be the ordered set of isomorphism types of finite distributive lattices, where the ordering is by embeddability. We study first-order definability in this ordered set. We prove among other things that for every finite distributive lattice D, the set {d, d} is definable, where d and d are the isomorphism types of D and its opposite (D turned upside down). We prove that the only non-identit...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the Aristotelian Society (Hardback)

سال: 2009

ISSN: 0066-7374

DOI: 10.1111/j.1467-9264.2009.00257.x